A solution to Hammer's X-ray reconstruction problem
نویسندگان
چکیده
منابع مشابه
A Solution to Hammer’s X-ray Reconstruction Problem
We propose algorithms for reconstructing a planar convex body K from possibly noisy measurements of either its parallel X-rays taken in a fixed finite set of directions or its point X-rays taken at a fixed finite set of points, in known situations that guarantee a unique solution when the data is exact. The algorithms construct a convex polygon Pk whose X-rays approximate (in the least squares ...
متن کاملPhase Problem in X-ray Crystallography, and Its Solution
X-ray diffraction provides one of the most important tools for examining the three-dimensional (3D) structure of biological macromolecules. The physics of diffraction requires that in order to resolve features of atomic structure it is necessary to employ radiation with a wavelength of the order of atomic spacing or smaller. Xrays have suitable wavelength, and interact with the electrons of the...
متن کاملThe solution to the partition reconstruction problem
Given a partition λ of n, a k-minor of λ is a partition of n − k whose Young diagram fits inside that of λ. We find an explicit function g(n) such that any partition of n can be reconstructed from its set of k-minors if and only if k ≤ g(n). In particular, partitions of n ≥ k2 + 2k are uniquely determined by their sets of k-minors. This result completely solves the partition reconstruction prob...
متن کاملX-Ray, Crystal Structure and Solution Phase Studies of a Polymeric SrII Compound
In the crystal structure of the title polymeric compound, [C42H38N6O33Sr5.2(H2O)]n, five independent metal atoms (Sr1-Sr5) have different coordination environments. The Sr1 and Sr5 atoms are nine coordinated and feature distorted tricapped trigonal-prismatic and capped square-antiprismatic geometries, respectively....
متن کاملA distributed solution to the network reconstruction problem
It has been recently shown in [1] that by collecting noise-contaminated time series generated by a coupled-oscillator system at each node of a network, it is possible to robustly reconstruct its topology, i.e. determine the graph Laplacian. Restricting ourselves to linear consensus dynamics over undirected communication networks, in this paper we introduce a new dynamic average consensus least-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2007
ISSN: 0001-8708
DOI: 10.1016/j.aim.2007.02.005